Detecting strong cliques
نویسندگان
چکیده
منابع مشابه
Average-case complexity of detecting cliques
The computational problem of testing whether a graph contains a complete subgraph of size k is among the most fundamental problems studied in theoretical computer science. This thesis is concerned with proving lower bounds for k-CLIQUE, as this problem is known. Our results show that, in certain models of computation, solving k-CLIQUE in the average case requires Q(nk/4) resources (moreover, k/...
متن کاملGraphs vertex-partitionable into strong cliques
A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called localizable graphs and defined as graphs having a partition of the vertex set into strong cliques, where a clique in a graph is strong if it intersects all maximal independent sets. Yamashita and Kameda observed that all ...
متن کاملDetecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between our formulation with a new algebraic tool, namely Radon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Practical approximation al...
متن کاملDetecting Strong Prosodic Events
This work presents an approach for detecting strong prosodic events (i.e. emphasized words) in speech signals. The detection of emphasis is useful in speech-to-speech translation. It helps to ensure that post-translation prosody reflects speakers’ original intentions, i.e. translated words corresponding to emphasized words in the input signal are also emphasized in the translated signal. The st...
متن کاملDetecting Strong Ties Using Network Motifs
Detecting strong ties among users in social and information networks is a fundamental operation that can improve performance on a multitude of personalization and ranking tasks. There are a variety of ways a tie can be deemed “strong”, and in this work we use a data-driven (or supervised) approach by assuming that we are provided a sample set of edges labeled as strong ties in the network. Such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.06.010